DRE-ip: A Verifiable E-Voting Scheme Without Tallying Authorities
نویسندگان
چکیده
Nearly all verifiable e-voting schemes require trustworthy authorities to perform the tallying operations. An exception is the DRE-i system which removes this requirement by pre-computing all encrypted ballots before the election using random factors that will later cancel out and allow the public to verify the tally after the election. While the removal of tallying authorities significantly simplifies election management, the pre-computation of ballots necessitates secure ballot storage, as leakage of precomputed ballots endangers voter privacy. In this paper, we address this problem and propose DRE-ip (DRE-i with enhanced privacy). Adopting a different design strategy, DRE-ip is able to encrypt ballots in real time in such a way that the election tally can be publicly verified without decrypting the cast ballots. As a result, DRE-ip achieves end-to-end verifiability without tallying authorities, similar to DRE-i, but with a significantly stronger guarantee on voter privacy. In the event that the voting machine is fully compromised, the assurance on tallying integrity remains intact and the information leakage is limited to the minimum: only the partial tally at the time of compromise is leaked.
منابع مشابه
DRE-i and Self-Enforcing E-Voting
This chapter1 describes a research experience of designing, implementing and trialling a new e-voting system called Direct Recording Electronic with Integrity (DRE-i). DRE-i is an example of a new category of voting systems that are end-to-end (E2E) verifiable without involving any tallying authorities. Such voting systems are termed “self-enforcing e-voting”.
متن کاملEvery Vote Counts: Ensuring Integrity in Large-Scale Electronic Voting
This paper presents a new End-to-End (E2E) verifiable e-voting protocol for large-scale elections, called Direct Recording Electronic with Integrity (DRE-i). In contrast to all other E2E verifiable voting schemes, ours does not involve any Tallying Authorities (TAs). The design of DRE-i is based on the hypothesis that existing E2E voting protocols’ universal dependence on TAs is a key obstacle ...
متن کاملCOMPUTING SCIENCE Verifiable Classroom Voting: Where Cryptography Meets Pedagogy
In this paper, we propose and have implemented the first verifiable classroom voting system. The subject of secure classroom voting has so far received almost no attention from the security community. Though several commercial classroom voting systems have been available, none of them is verifiable. State-of-the-art verifiable voting protocols all rely on finding a set of trustworthy tallying a...
متن کاملVerifiable Classroom Voting: Where Cryptography Meets Pedagogy
In this paper, we propose and have implemented the rst veri able classroom voting system. The subject of secure classroom voting has so far received almost no attention from the security community. Though several commercial classroom voting systems have been available, none of them is veri able. State-of-the-art veri able voting protocols all rely on nding a set of trustworthy tallying authorit...
متن کاملTransparent, Auditable, and Stepwise Verifiable Online E-Voting Enabling an Open and Fair Election
Many e-voting techniques have been proposed but not widely used in reality. One of the problems associated with most existing e-voting techniques is the lack of transparency, leading to a failure to deliver voter assurance. In this work, we propose a transparent, auditable, stepwise verifiable, viewable, and mutual restraining e-voting protocol that exploits the existing multi-party political d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016